Monadic Definability of Ordinals
نویسنده
چکیده
We identify precisely which singular ordinals are definable by monadic second order formulae over the ordinals, assuming knowledge of the definable regular cardi-
منابع مشابه
Finite state automata and monadic definability of singular cardinals
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formula over the ordinals. A formula φ is monadic second order (monadic for short) if each of its variables is assigned a type, either the type “first order” or the type “second order.” When interpreting the formula over a...
متن کاملCovering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given structure, whereas such a formula cannot exist for ordinals themselves. The structures are precisely classified in the pushdown hierarchy. Ordinals are also located in the hierarchy, and a direct presentation is given. ...
متن کاملSelection over classes of ordinals expanded by monadic predicates
A monadic formula ψ(Y ) is a selector for a monadic formula φ(Y ) in a structure M if ψ defines inM a unique subset P of the domain and this P also satisfies φ inM. If C is a class of structures and φ is a selector for ψ in everyM ∈ C, we say that φ is a selector for φ over C. For a monadic formula φ(X, Y ) and ordinals α ≤ ω1 and δ < ω , we decide whether there exists a monadic formula ψ(X, Y ...
متن کاملSelection over classes of ordinals expanded by monadic predicates - Alexander Rabinovich and Amit Shomrat.dvi
A monadic formula ψ(Y) is a selector for a monadic formula φ(Y) in a structure M if ψ defines in M a unique subset P of the domain and this P also satisfies φ in M. If C is a class of structures and φ is a selector for ψ in every M ∈ C, we say φ is a selector for φ over C. For a monadic formula φ(X,Y) and ordinals α ≤ ω1 and δ < ω, we decide whether there exists a monadic formula ψ(X,Y) such th...
متن کاملThe Theory of Rational Relations on Transfinite Strings
In order to explain the purpose of this paper, we recall briefly how the theory of “rationality” developed in the last fourty years. The theory of sets of finite strings recognized by finite automata, also known as regular or rational sets was developed in the fifties. It rapidly extended in two directions. Indeed, by solving the decidability problem of the second order monadic theory of one su...
متن کامل